Proving, Refuting, Improving—Looking for a Theorem

نویسندگان

چکیده

Exploring the proofs and refutations of an abstract statement, conjecture with aim to give a formal syntactic treatment its proving–refuting process, we introduce notion extrapolation possibly unprovable statement having form if A, then B, propose procedure that should result in new A′, B′, which is similar starting one, but provable. We think this procedure, based on method, can be considered basic methodological tool applicable prove–refute–improve any conjecture. This notion, extrapolation, presents dual counterpart well-known interpolation introduced traditional logic sixty-five years ago.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Theorem Proving for Verification

The challenges in using theorem proving for verification of parallel systems are to achieve adequate automation, and to allow human guidance to be expressed in terms of the system under examination rather than the mechanisms of the prover. This paper provides an overview of techniques that address these challenges.

متن کامل

Theorem Proving for the

This paper discusses the challenges of adding symbolic computation capabilities to a computer algebra system. Indeed, a simple expressions such as m × n can be evaluated to a full value when both m and n have known values. However, if one or both of them have no definite value, then most CASs treat them as symbols and a syntactic representation of some kind is returned. Most CASs do this withou...

متن کامل

A new tool for proving Vizing's Theorem

The known proofs of the famous theorem of Vizing on edge coloring of (multi)graphs are not long but sophisticated. The main goal of this note is to present an auxiliary (multi)digraph that simplifies and facilitates proofs of it. The secondary goal is to use the approach for proofs of Vizing’s Adjacency Lemma and the Andersen-Goldberg Theorem. Mathematics Subject Classification: 05C15, 05C35, 0...

متن کامل

SMTtoTPTP - A Converter for Theorem Proving Formats

SMTtoTPTP is a converter from proof problems written in the SMT-LIB format into the TPTP TFF format. The SMT-LIB format supports polymorphic sorts and frequently used theories like those of uninterpreted function symbols, arrays, and certain forms of arithmetics. The TPTP TFF format is an extension of the TPTP format widely used by automated theorem provers, adding a sort system and arithmetic ...

متن کامل

Modular Redundancy for Theorem Proving

We introduce a notion of modular redundancy for theorem proving. It can be used to exploit redundancy elimination techniques (like tautology elimination, subsumption, demodulation or other more reened methods) in combination with arbitrary existing theorem provers, in a refutation complete way, even if these provers are not (or not known to be) complete in combination with the redundancy techni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Axioms

سال: 2022

ISSN: ['2075-1680']

DOI: https://doi.org/10.3390/axioms11100559